10,100 research outputs found

    Maximum Inner-Product Search using Tree Data-structures

    Full text link
    The problem of {\em efficiently} finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied in literature. However, a closely related problem of efficiently finding the best match with respect to the inner product has never been explored in the general setting to the best of our knowledge. In this paper we consider this general problem and contrast it with the existing best-match algorithms. First, we propose a general branch-and-bound algorithm using a tree data structure. Subsequently, we present a dual-tree algorithm for the case where there are multiple queries. Finally we present a new data structure for increasing the efficiency of the dual-tree algorithm. These branch-and-bound algorithms involve novel bounds suited for the purpose of best-matching with inner products. We evaluate our proposed algorithms on a variety of data sets from various applications, and exhibit up to five orders of magnitude improvement in query time over the naive search technique.Comment: Under submission in KDD 201

    A SYSTEM-WIDE APPROACH FOR ANALYZING THE EFFECT OF EXCHANGE RATES ON FRESH APPLE IMPORT DEMAND

    Get PDF
    This study examines the impact of changes in exchange rate and import market composition on fresh apple import demand using source differentiated import demand functions. We modify the standard Rotterdam model to incorporate exchange rate effects by revisiting Barten's fundamental matrix equation of consumer demand theory and viewing exchange rate as a "sticky" preference variable. The results show that the preference variable had a significant impact on UK but not on Malaysian and Saudi Arabian import demands.International Relations/Trade,

    Star Clusters in the Magellanic Clouds-1: Parameterisation and Classification of 1072 Clusters in the LMC

    Full text link
    We have introduced a semi-automated quantitative method to estimate the age and reddening of 1072 star clusters in the Large Magellanic Cloud (LMC) using the Optical Gravitational Lensing Experiment (OGLE) III survey data. This study brings out 308 newly parameterised clusters. In a first of its kind, the LMC clusters are classified into groups based on richness/mass as very poor, poor, moderate and rich clusters, similar to the classification scheme of open clusters in the Galaxy. A major cluster formation episode is found to happen at 125 +- 25 Myr in the inner LMC. The bar region of the LMC appears prominently in the age range 60 - 250 Myr and is found to have a relatively higher concentration of poor and moderate clusters. The eastern and the western ends of the bar are found to form clusters initially, which later propagates to the central part. We demonstrate that there is a significant difference in the distribution of clusters as a function of mass, using a movie based on the propagation (in space and time) of cluster formation in various groups. The importance of including the low mass clusters in the cluster formation history is demonstrated. The catalog with parameters, classification, and cleaned and isochrone fitted CMDs of 1072 clusters, which are available as online material, can be further used to understand the hierarchical formation of clusters in selected regions of the LMC.Comment: 19 pages, 19figures, published in MNRAS on August 16, 2016 Supplementary material is available in the MNRAS websit
    corecore